On-stack replacement, distilled

On-Stack Replacement à la Carte

On-stack replacement (OSR) dynamically transfers execution between different code versions. This mechanism is used in mainstream runtime systems to support adaptive and speculative optimizations by running code tailored to provide the best expected performance for the actual workload. Current approaches either restrict the program points where OSR can be fired or require complex optimization-sp...

Efficient and General On-Stack Replacement for Aggressive Program Specialization

Efficient and General On-Stack Replacement for Aggressive Program Specialization

Efficient invalidation and dynamic replacement of executing code – on-stack replacement (OSR), is necessary to facilitate effective, aggressive, specialization of object-oriented programs that are dynamically loaded, incrementally compiled, and garbage collected. Extant OSR mechanisms restrict the performance potential of program specialization since their implementations are special-purpose an...

On Stack-augmented Polyautomata on Stack-augmented Polyautomata

A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of real-time, linear-time and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered.

K Framework Distilled

K is a rewrite-based executable semantic framework in which programming languages, type systems, and formal analysis tools can be defined using configurations, computations and rules. Configurations organize the state in units called cells, which are labeled and can be nested. Computations are special nested list structures sequentializing computational tasks, such as fragments of program. K (r...